Computer interconnection networks with virtual cut-through routing
نویسندگان
چکیده
منابع مشابه
Analytical Modeling of Routing Algorithms in Virtual Cut-Through Networks
Contemporary multicomputer networks reduce communication latency by allowing an in-transit packet to \cut through" intermediate nodes to idle outgoing links, instead of buuering at each hop in its route. Under these cut-through switching schemes, routing algorithms innuence performance by determining whether an incoming packet can locate an idle output link. This paper presents analytical model...
متن کاملShortest-path Routing in Homogeneous Point-to-Point Networks With Virtual Cut-Through Switching
Much research in recent years has focused on various routing strategies for supporting ee-cient communication in point-to-point networks. Other research has emphasized novel switching techniques, such as virtual cut-through and wormhole switching. However, little attention has been paid to the subtle interplay between routing and switching schemes. It is desirable to select routing strategies t...
متن کاملVirtual Cut - Through Implementation of the HB Packet Switching Routing
In the last years, since the early 80’s, wormhole and virtual cut-through routing modalities have replaced packet switching and circuit switching schemes. In this paper we give the theoretical bases to implement hole based (HB) routing algorithm [3] by using the virtual cut-through
متن کاملAdaptive Virtual Cut-Through as a Viable Routing Method
Adaptive virtual cut-through is considered as a viable alternative to wormhole switching for fast and hardware-efficient interprocessor communication in multicomputers. Computer simulations are used to show that our implementation of a minimal-path fully-adaptive virtual cut-through algorithm outperforms both deterministic and adaptive wormhole switching methods under both uniform random messag...
متن کاملVirtual Cut-Through: A New Computer Communication Switching Technique
In this paper a new switching technique called virtual cut-through is proposed and its performance is analyzed. This switching system is very similar to message switching, with the difference that when a message arrives in an intermediate node and its selected outgoing channel is free (just after the reception of the header), then, in contrast to message switching, the message is sent out to th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Procedia Computer Science
سال: 2019
ISSN: 1877-0509
DOI: 10.1016/j.procs.2019.08.062